A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization
نویسندگان
چکیده
منابع مشابه
Algorithms to Solve Hierarchically Semi-separable Systems
‘Hierarchical Semi-separable’ matrices (HSS matrices) form an important class of structured matrices for which matrix transformation algorithms that are linear in the number of equations (and a function of other structural parameters) can be given. In particular, a system of linear equations Ax = b can be solved with linear complexity in the size of the matrix, the overall complexity being line...
متن کاملA Fast Memory Efficient Construction Algorithm for Hierarchically Semi-Separable Representations
Existing Hierarchically Semi-Separable (HSS) construction algorithms for dense n×n matrices require as much as O(n2) peak workspace memory, at a cost of O(n2) flops. An algorithm is presented which requires O(n1.5) peak worskpace memory in the worst case, while still requiring only O(n2) flops.
متن کاملRandom–Matrix Ensembles for Semi–Separable Systems
– Many models for chaotic systems consist of joining two integrable systems with incompatible constants of motion. The quantum counterparts of such models have a propagator which factorizes into two integrable parts. Each part can be diagonalized. The two eigenvector bases are related by an orthogonal (or unitary) transformation. We construct a random matrix ensemble that mimics this situation ...
متن کاملIterative solution methods based on the Hierarchically Semi-Separable Representation
In this paper, we study an important class of structured matrices: ”Hierarchically Semi-Separable (HSS)” matrices, for which an efficient hierarchical state based representation called Hierarchically Semi-Separable (HSS) representation can be used to utilize the data sparsity of the HSS matrices. A novel algorithm with O(n) complexity is proposed to construct suboptimal HSS representations from...
متن کاملUsing Dense Matrix Computations in the Solution of Sparse Problems
On many high-speed computers the dense matrix technique is preferable to sparse matrix technique when the matrices are not very large, because the high computational speed compensates fully the disadvantages of using more arithmetic operations and more storage. Dense matrix techniques can still be used if the computations are successively carried out in a sequence of large dense blocks. A metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Mathematical Software
سال: 2016
ISSN: 0098-3500,1557-7295
DOI: 10.1145/2930660